MA3H2 Markov Processes and Percolation theory
نویسنده
چکیده
منابع مشابه
MA 3 H 2 Markov Processes and Percolation Theory ( Support Class 3 )
A Markov chain is a discrete time Markov process, i.e. the future of the process is determined by the present and independent of the past. Definition 1.2. A Markov process is time-homogeneous if there exists a measurable map P from X into P (X ), the space of probability measures on X , such that P(Xn ∈ A|Xn−1 = a) = P (a;A) for every A ∈ B(X ), almost every a ∈ X , and every n > 0. We call P t...
متن کاملLower and Upper Bounds for the Survival of Infinite Absorbing Markov Chains
A wide variety of problems in the domain of directed percolation theory, contact process, voter models rely on the analysis of a infinite absorbing Markov chain. Although results for these problems have been obtained through other approaches, reasoning about the Markov chain gives rise to elegant results that are often explicit functions of the chain parameters. This allows results to be reused...
متن کاملPercolation Thresholds of Updated Posteriors for Tracking Causal Markov Processes in Complex Networks
Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of node states resulting from actively monitoring the network. Since traditional percolation thresholds are derived using observation independent Marko...
متن کاملA model for modified electrode with carbon nanotube composites using percolation theory in fractal space
We introduce a model for prediction the behavior of electrodes which modified withcarbon nanotubes in a polymer medium. These kinds of polymer composites aredeveloped in recent years, and experimental data for its percolation threshold isavailable. We construct a model based on percolation theory and fractal dimensionsand using experimental percolation threshold for calculating the moments of c...
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015